Some Enumerational Results Relating the Numbers of Latin and Frequency Squares of order n
نویسندگان
چکیده
We discuss some enumerational results relating the numbers of F (n;λ1, ..., λm) and F (n;λ ′ 1, ..., λ ′ k) frequency squares of order n. In particular, for any frequency vector (λ1, ..., λm) of n, we discuss some enumerational results relating the number of F (n;λ1, ..., λm) frequency squares and the number of latin squares of order n. In Section 4 we also discuss some enumerational results for latin rectangles.
منابع مشابه
A census of critical sets in the Latin squares of order at most six
A critical set in a Latin square of order n is a set of entries in a Latin square which can be embedded in precisely one Latin square of order n. Also, if any element of the critical set is deleted, the remaining set can be embedded in more than one Latin square of order n. In this paper we find all the critical sets of different sizes in the Latin squares of order at most six. We count the num...
متن کاملLatin squares and critical sets of minimal size
IsotoIHsl:n that lower bounds for infinite N of order n. hand or computer, strong critical sets of minimum nOn-lS01110Tnitnc reduced latin squares of order less than or of order 6. These latin squares have been taken from 129 onwards. We summarise our results in Table the numbering system listed by Denes and Keedwell latin squares. This numbering system is based on the ,<:n,,-r1i',rrHl1<:rn cla...
متن کاملNearly Orthogonal Latin Squares
A Latin square of order n is an n by n array in which every row and column is a permutation of a set N of n elements. Let L = [li,j ] and M = [mi,j ] be two Latin squares of even order n, based on the same N -set. Define the superposition of L onto M to be the n by n array A = (li,j ,mi,j). When n is even, L and M are said to be nearly orthogonal if the superposition of L onto M has every order...
متن کاملOn Orthogonality of Latin Squares
Abstract: A Latin square arrangement is an arrangement of s symbols in s rows and s columns, such that every symbol occurs once in each row and each column. When two Latin squares of same order superimposed on one another, then in the resultant array every ordered pair of symbols occurs exactly once, then the two Latin squares are said to be orthogonal. A frequency square M of type F (n; λ) is ...
متن کاملLatin Squares in a Cayley Table
Let G be a finite group of order n ≥ 2 and T be the Cayley table of G. Obviously T is a Latin square. In this paper we study submatrices of T which are Latin squares. Let Lm(G) where m ≤ n be the number of Latin squares of order m in T . We compute Lm(G) and study some properties of such submatrices. Also we classify the Latin squares of order m in T and compute the number of each classes in so...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012